Cuts over Extended Formulations by Flow Discretization
نویسنده
چکیده
Large-sized extended formulations have the potential for providing high-quality bounds on some combinatorial optimization problems where the natural formulations perform poorly. This chapter discusses the use of some families of cuts that have been recently applied on extended formulations that are obtained by the discretization of the continuous variables occurring in the natural formulation of the Fixed Charge Network Flow Problem. By interpreting the flows as being link capacities, loads or times, similar cuts can be used on problems like the Capacitated Minimum Spanning Tree, Vehicle Routing and Parallel-Machine Scheduling.
منابع مشابه
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequalities that is exponential in the size of the data needed to describe the problem. Here we are p...
متن کاملSplit cuts and extended formulations for Mixed Integer Conic Quadratic Programming
We study split cuts and extended formulations for Mixed Integer Conic Quadratic Programming (MICQP) and their relation to Conic Mixed Integer Rounding (CMIR) cuts. We show that CMIR is a linear split cut for the polyhedral portion of an extended formulation of a quadratic set and it can be weaker than the nonlinear split cut of the same quadratic set. However, we also show that families of CMIR...
متن کاملRektor Gomory Cuts from a Position - Indexed Formulation of 1 D Stock Cutting
Most integer programming problems can be formulated in several ways. Some formulations are better suited for solution by exact methods, because they have either (i) a strong LP relaxation, (ii) few symmetries in the solution space, or both. However, solving one formulation, we can often branch and/or add cutting planes which are implicitly based on variables of other formulations, working in fa...
متن کاملApproximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involving new variables is a possible alternative, but this often results in prohibitively large MIPs where even the linear programming relaxations are hard or impossible to solve. In this paper, we demonstrate how, in cert...
متن کاملGomory Cuts from a Position-Indexed Formulation of 1D Stock Cutting
Most integer programming problems can be formulated in several ways. Some formulations are better suited for solution by exact methods, because they have either (i) a strong LP relaxation, (ii) few symmetries in the solution space, or both. However, solving one formulation, we can often branch and/or add cutting planes which are implicitly based on variables of other formulations, working in fa...
متن کامل